2

On the Complexity of Succinct Zero-Sum Games

Year:
2008
Language:
english
File:
PDF, 557 KB
english, 2008
5

The Minimum Equivalent DNF Problem and Shortest Implicants

Year:
2001
Language:
english
File:
PDF, 149 KB
english, 2001
7

The complexity of the matroid–greedoid partition problem

Year:
2009
Language:
english
File:
PDF, 525 KB
english, 2009
8

On the complexity of approximating the VC dimension

Year:
2002
Language:
english
File:
PDF, 181 KB
english, 2002
9

Pseudo-random generators for all hardnesses

Year:
2003
Language:
english
File:
PDF, 273 KB
english, 2003
11

Pseudorandomness for Approximate Counting and Sampling

Year:
2006
Language:
english
File:
PDF, 355 KB
english, 2006
12

Reconstructive Dispersers and Hitting Set Generators

Year:
2009
Language:
english
File:
PDF, 445 KB
english, 2009
13

Lossless Condensers, Unbalanced Expanders, And Extractors

Year:
2007
Language:
english
File:
PDF, 386 KB
english, 2007
14

The complexity of Boolean formula minimization

Year:
2011
Language:
english
File:
PDF, 206 KB
english, 2011
15

Fast Polynomial Factorization and Modular Composition

Year:
2011
Language:
english
File:
PDF, 427 KB
english, 2011
16

Low-End Uniform Hardness versus Randomness Tradeoffs for AM

Year:
2009
Language:
english
File:
PDF, 419 KB
english, 2009
19

On sunflowers and matrix multiplication

Year:
2013
Language:
english
File:
PDF, 390 KB
english, 2013
30

Simple extractors for all min-entropies and a new pseudorandom generator

Year:
2005
Language:
english
File:
PDF, 317 KB
english, 2005